Stable sets for (P6, K2, 3)-free graphs
نویسنده
چکیده
The Maximum Stable Set (MS) problem is a well known NP-hard problem. However different graph classes for which MS can be efficiently solved have been detected and the augmenting graph technique seems to be a fruitful tool to this aim. In this paper we apply a recent characterization of minimal augmenting graphs [22] to prove that MS can be solved for (P6,K2,3)-free graphs in polynomial time, extending some known results.
منابع مشابه
The stable set polytope of ($P_6$, triangle)-free graphs and new facet-inducing graphs
The stable set polytope of a graph G, denoted as STAB(G), is the convex hull of all the incidence vectors of stable sets of G. To describe a linear system which defines STAB(G) seems to be a difficult task in the general case. In this paper we present a complete description of the stable set polytope of (P6,triangle)-free graphs (and more generally of (P6,paw)-free graphs). For that we combine ...
متن کاملWeighted independent sets in a subclass of P6-free graphs
TheMaximum Weight Independent Set (MWIS) problem on graphs with vertex weights asks for a set of pairwise nonadjacent vertices of maximum total weight. The complexity of the MWIS problem for P6-free graphs is unknown. In this note, we show that the MWIS problem can be solved in time O(nm) for (P6, banner)-free graphs by analyzing the structure of subclasses of these class of graphs. This extend...
متن کاملEfficient Domination for Some Subclasses of P_6 -free Graphs in Polynomial Time
Let G be a finite undirected graph. A vertex dominates itself and all its neighbors in G. A vertex set D is an efficient dominating set (e.d. for short) of G if every vertex of G is dominated by exactly one vertex of D. The Efficient Domination (ED) problem, which asks for the existence of an e.d. in G, is known to be NP-complete even for very restricted graph classes such as P7-free chordal gr...
متن کاملLinearly $\chi$-Bounding $(P_6,C_4)$-Free Graphs
Given two graphs H1 and H2, a graph G is (H1,H2)-free if it contains no subgraph isomorphic to H1 or H2. Let Pt and Cs be the path on t vertices and the cycle on s vertices, respectively. In this paper we show that for any (P6, C4)-free graph G it holds that χ(G) ≤ 3 2 ω(G), where χ(G) and ω(G) are the chromatic number and clique number of G, respectively. Our bound is attained by several graph...
متن کاملNew Polynomial Case for Efficient Domination in P 6-free Graphs
In a graph G, an efficient dominating set is a subset D of vertices such that D is an independent set and each vertex outside D has exactly one neighbor in D. The Efficient Dominating Set problem (EDS) asks for the existence of an efficient dominating set in a given graph G. The EDS is known to be NP -complete for P7-free graphs, and is known to be polynomial time solvable for P5-free graphs. H...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 32 شماره
صفحات -
تاریخ انتشار 2012